Quickest Paths in Simulations of Pedestrians
نویسندگان
چکیده
This contribution proposes a method to make agents in a microscopic simulation of pedestrian traffic walk approximately along a path of estimated minimal remaining travel time to their destination. Usually models of pedestrian dynamics are (implicitly) built on the assumption that pedestrians walk along the shortest path. Model elements formulated to make pedestrians locally avoid collisions and intrusion into personal space do not produce motion on quickest paths. Therefore a special model element is needed, if one wants to model and simulate pedestrians for whom travel time matters most (e.g. travelers in a station hall who are late for a train). Here such a model element is proposed, discussed and used within the Social Force Model.
منابع مشابه
A comprehensive survey on the quickest path problem
This work is a survey on a special minsum-maxmin bicriteria problem, known as the quickest path problem, that can model the transmission of data between two nodes of a network. Moreover, the authors review the problems of ranking the K quickest paths, and the K quickest loopless paths, and compare them in terms of the worst-case complexity order. The classification presented led to the proposal...
متن کاملProbabilistic quickest path algorithm
Due to the increasing role of quickest paths for on-demand routing in computer networks, it is important to compute them faster, perhaps, by trading-o3 the quality for computational speed. We consider the computation of a quickest path from a source node to a destination node for a given message size in a network with n nodes and m links each of which is speci6ed by bandwidth and delay. Every k...
متن کاملModeling the Dynamic Route Choice of Pedestrians to Assess the Criticality of Building Evacuation
This paper presents an event-driven way finding algorithm for pedestrians in an evacuation scenario, which operates on a graph-based structure. The motivation of each pedestrian is to leave the facility. The events used to redirect pedestrians include the identification of a jam situation and/or identification of a better route than the current. This study considers two types of pedestrians: fa...
متن کاملAlgorithms for the quickest path problem and the enumeration of quickest paths
Let N = (V, R, e, I) be an input network with node set V, arc set A, positive arc weight function c and nonnegative arc weight function 1. Let u be the amount of data to be transmitted. The quickest path problem is to find a routing path in N to transmit the given amount of data in minimum time. In a recent paper, Chen and Chin proposed this problem and developed algorithms for the single pair ...
متن کاملVisualizing Quickest Visibility Maps
Consider the following modification to the shortest path query problem in polygonal domains: instead of finding shortest path to a query point q, we find the shortest path to any point that sees q. We present an interactive visualization applet visualizing these quickest visibility paths. The applet also visualizes quickest visibility maps, that is the subdivision of the domain into cells by th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Advances in Complex Systems
دوره 14 شماره
صفحات -
تاریخ انتشار 2011